Towers of Hanoi - определение. Что такое Towers of Hanoi
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое Towers of Hanoi - определение

MATHEMATICAL GAME OR PUZZLE
Towers of Hanoi; Towers of hanoi; Tower of hanoi; Arkymalarky; Tower of Brahma; Reve's puzzle; Hanoi towers; Tower of hanio; Tower of Hanoi puzzle; Hanoi tower; Reve puzzle; Frame-Stewart algorithm; Frame-Stewart conjecture; Tower Of Hanoi; Towers Of Hanoi; Towers of Brahma; Lucas tower; Lucas' Tower; Tower of Benares; Frame–Stewart algorithm
  • Final configuration of bicolor Towers of Hanoi (n=4)
  • Initial configuration of bicolor Towers of Hanoi (n=4)
  • The game graph of level 7 shows the relatedness to the [[Sierpiński triangle]].
  • Animation of an iterative algorithm solving 6-disk problem
  • bibcode=2014NanoL..14.7188Y}}</ref>
  • A model set of the Tower of Hanoi (with 8 disks)
  • An animated solution of the '''Tower of Hanoi''' puzzle for ''T''(4, 3)
  • Illustration of a recursive solution for the Towers of Hanoi puzzle with 4 disks. In [{{filepath:Tower_of_Hanoi_recursion_SMIL.svg}} the SVG file,] click a grey button to expand or collapse it
  • Universum Museum]]

Towers of Hanoi         
<games> A classic computer science problem, invented by Edouard Lucas in 1883, often used as an example of recursion. "In the great temple at Benares, says he, beneath the dome which marks the centre of the world, rests a brass plate in which are fixed three diamond needles, each a cubit high and as thick as the body of a bee. On one of these needles, at the creation, God placed sixty-four discs of pure gold, the largest disc resting on the brass plate, and the others getting smaller and smaller up to the top one. This is the Tower of Bramah. Day and night unceasingly the priests transfer the discs from one diamond needle to another according to the fixed and immutable laws of Bramah, which require that the priest on duty must not move more than one disc at a time and that he must place this disc on a needle so that there is no smaller disc below it. When the sixty-four discs shall have been thus transferred from the needle on which at the creation God placed them to one of the other needles, tower, temple, and Brahmins alike will crumble into dust, and with a thunderclap the world will vanish." The recursive solution is: Solve for n-1 discs recursively, then move the remaining largest disc to the free needle. Note that there is also a non-recursive solution: On odd-numbered moves, move the smallest sized disk clockwise. On even-numbered moves, make the single other move which is possible. ["Mathematical Recreations and Essays", W W R Ball, p. 304] {hanoi">The rec.puzzles Archive (http://rec-puzzles.org/sol.pl/induction/hanoi)}. (2003-07-13)
Tower of Hanoi         
The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape.
Magnetic Tower of Hanoi         
  • The solution of the ''n''&nbsp;=&nbsp;2 puzzle
  • The final position of the puzzle
  • The number of moves required for optimal solutions of different variations of the MToH puzzle
  • An illustration of the magnetism: Disks magnetically repel each other if their touching sides have the same color
  • The initial position of the puzzle
VARIATION OF THE TOWER OF HANOI (TOH) PUZZLE
Magnetic tower of Hanoi
The Magnetic Tower of Hanoi (MToH) puzzle is a variation of the classical Tower of Hanoi puzzle (ToH), where each disk has two distinct sides, for example, with different colors "red" and "blue". The rules of the MToH puzzle are the same as the rules of the original puzzle, with the added constraints that each disk is flipped as it is moved, and that two disks may not be placed one on another if their touching sides have the same color.

Википедия

Tower of Hanoi

The Tower of Hanoi (also called The problem of Benares Temple or Tower of Brahma or Lucas' Tower and sometimes pluralized as Towers, or simply pyramid puzzle) is a mathematical game or puzzle consisting of three rods and a number of disks of various diameters, which can slide onto any rod. The puzzle begins with the disks stacked on one rod in order of decreasing size, the smallest at the top, thus approximating a conical shape. The objective of the puzzle is to move the entire stack to the last rod, obeying the following rules:

  1. Only one disk may be moved at a time.
  2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack or on an empty rod.
  3. No disk may be placed on top of a disk that is smaller than it.

With 3 disks, the puzzle can be solved in 7 moves. The minimal number of moves required to solve a Tower of Hanoi puzzle is 2n − 1, where n is the number of disks.